Enlarged Search Space for SITG Parsing

نویسندگان

  • Guillem Gascó i Mora
  • Joan-Andreu Sánchez
  • José-Miguel Benedí
چکیده

Stochastic Inversion Transduction Grammars constitute a powerful formalism in Machine Translation for which an efficient Dynamic Programming parsing algorithm exists. In this work, we review this parsing algorithm and propose important modifications that enlarge the search space. These modifications allow the parsing algorithm to search for more and better solutions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Statistical parsing with non-local dependencies

Non-local dependencies occur when a head (e.g. a verb) and its dependent (e.g. an argument) is separated by some intervening material which does not depend on the same head. Because non-local dependencies play an important role in determining predicate–argument structure of sentences, identifying them correctly is essential for Natural Language Processing. However, this task appears to be rathe...

متن کامل

Incorporating Satellite Documents into Co-citation Networks for Scientific Paper Searches

To improve the search performance of retrieval methods using cocitation linkages, this study proposes a technique to enlarge a co-citation network by incorporating satellite documents. This technique specifies satellite documents via full-text searches for terms obtained from documents having cocitation linkages with a seed document; the appropriateness of each co-citation linkage is checked by...

متن کامل

Stochastic Dependency Parsing Based on A* Admissible Search

Dependency parsing has gained attention in natural language understanding because the representation of dependency tree is simple, compact and direct such that robust partial understanding and task portability can be achieved more easily. However, many dependency parsers make hard decisions with local information while selecting among the next parse states. As a consequence, though the obtained...

متن کامل

Controlling Search in Flexible Parsing

Most natural language parsers require their input to be grammatical. This significantly constrains the search space that they must explore during parsing. Parsers which attempt to recover from extragrammatical input contend with a search space that is potentially much larger, since they cannot necessarily prune branches when grammatical expectations are violated. In this paper we discuss the co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010